The spanning ratio of the Delaunay triangulation is greater than pi/2

نویسندگان

  • Prosenjit Bose
  • Luc Devroye
  • Maarten Löffler
  • Jack Snoeyink
  • Vishal Verma
چکیده

Consider the Delaunay triangulation T of a set P of points in the plane. The spanning ratio of T , i.e. the maximum ratio between the length of the shortest path between this pair on the graph of the triangulation and their Euclidean distance. It has long been conjectured that the spanning ratio of T can be at most π/2. We show in this note that there exist point sets in convex position with a spanning ratio > 1.5810 and in general position with a spanning ratio > 1.5846, both of which are strictly larger than π/2 ≈ 1.5708. Furthermore, we show that any set of points drawn independently from the same distribution will, with high probability, have a spanning ratio larger than π/2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded Degree Planar Geometric Spanners

Given a set P of n points in the plane, we show how to compute in O(n logn) time a subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong planar t-spanner of P with t = (1 + √ 2) ∗ δ, where δ is the spanning ratio of the Delaunay triangulation. Furthermore, given a Delaunay triangulation, we show a distributed algorithm that computes the same bounded degree planar sp...

متن کامل

The Stretch Factor of the Delaunay Triangulation Is Less than 1.998

Let S be a finite set of points in the Euclidean plane. Let D be a Delaunay triangulation of S. The stretch factor (also known as dilation or spanning ratio) of D is the maximum ratio, among all points p and q in S, of the shortest path distance from p to q in D over the Euclidean distance ||pq||. Proving a tight bound on the stretch factor of the Delaunay triangulation has been a long standing...

متن کامل

Eecient Minimum Spanning Tree Construction without Delaunay Triangulation

Minimum spanning tree problem is a very important problem in VLSI CAD. Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs of points and takes at least (n 2) time. More eecient approaches nd a minimum spanning tree only among edges in the Delaunay triangulation of the po...

متن کامل

The dilation of the Delaunay triangulation is greater than {\pi}/2

Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p′ ∈ P , which is the ratio of the length of the shortest path from p to p′ in T over the Euclidean distance ‖pp′‖, can be at most π/2 ≈ 1.5708. In this paper, we show how to construct po...

متن کامل

Spanners of Additively Weighted Point Sets

We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs (p, r) where p is a point in the plane and r is a real number. The distance between two points (pi, ri) and (pj , rj) is defined as |pipj | − ri − rj . We show that in the case where all ri are positive numbers and |pipj | ≥ ri + rj for all i, j (in which case the po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009